To “ Admissibility in Games ” : Appendices

نویسنده

  • H. JEROME KEISLER
چکیده

Section S.1 continues the discussion in the main text of the definition of assumption and of the relationship between assumption and the concepts of (i) infinitely more likely than (Blume, Brandenburger, and Dekel (1991), henceforth BBD) and (ii) strong belief (Battigalli and Siniscalchi (2002), henceforth B-S). The focus is on the behavior of the assumption concept in the game, theoretic setting. Section S.2 examines our negative result (Theorem 10.1). It is impossible (under certain conditions) for rationality and common assumption of rationality (RCAR) to hold in a complete structure based on lexicographic probability systems (our Theorem 10.1). But it is possible for rationality and common strong belief of rationality (RCSBR) to hold in a complete structure based on conditional probability systems (Proposition 6 in B-S). What accounts for the difference? Finally, Section S.3 expands on the coverage of the literature in the main text.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Common reasoning about admissibility

We analyze common reasoning about admissibility in the strategic and extensive form of a game. We define a notion of sequential proper admissibility in the extensive form, and show that, in finite extensive games with perfect recall, the strategies that are consistent with common reasoning about sequential proper admissibility in the extensive form are exactly those that are consistent with com...

متن کامل

Admissible Strategies in Timed Games

In this paper, we study the notion of admissibility in timed games. First, we show that admissible strategies may not exist in timed games with a continuous semantics of time, even for safety objectives. Second, we show that the discrete time semantics of timed games is better behaved w.r.t. admissibility: the existence of admissible strategies is guaranteed in that semantics. Third, we provide...

متن کامل

Admissibility in Infinite Games

We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strategies, as a solution concept for extensive games of infinite horizon. This concept is known to provide a valuable criterion for selecting among multiple equilibria and to yield sharp predictions in finite games. However, generalisations to the infinite are inherently problematic, due to unbounded dominance...

متن کامل

Perfect and limit admissible perfect equilibria in discontinuous games

We compare the properties of several notions of perfectness within classes of compact, metric, and (possibly) discontinuous games, and show that in the presence of payoff discontinuities, standard notions of perfectness may fail a weakening of admissibility termed limit admissibility. We also provide conditions ensuring the existence of a limit admissible perfect equilibrium. These conditions a...

متن کامل

Admissibility in Quantitative Graph Games

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, under the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the notion ...

متن کامل

Admissibility in Concurrent Games∗†

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays ‘as well as possible’, because there is no other strategy that dominates it, i.e., that wins (almost surely) against a superset of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008